Level set methods to compute minimal surfaces in a medium with exclusions (voids)
نویسندگان
چکیده
منابع مشابه
Level set methods to compute minimal surfaces in a medium with exclusions ( voids )
In [59], periodic minimal surfaces in a medium with exclusions (voids) are constructed and in this paper we present two algorithms for computing these minimal surfaces. The two algorithms use evolution of level sets by mean curvature. The first algorithm solves the governing nonlinear PDE directly and enforces numerically an orthogonality condition that the surfaces satisfy when they meet the b...
متن کاملPlane-Like Minimal Surfaces in Periodic Media with Exclusions
I am indebted for many years of support and guidance, and also for leading me into the area of partial differential equations. Also, I am very grateful to Professor Rafael de la Llave for his encouragement and useful disscutions during my thesis work. I also express my gratitude to Professor Lawrence C. Evans for many interesting discussions, and for providing me with a great deal of insight to...
متن کاملOn a Simple Method to Compute Polygonal Minimal Surfaces
Given a closed polygonal contour with N+3 vertices in IR q (q 2) there is a one to one correspondence between the zeros of r and minimal surfaces spanned by ?, where () := inf v2X() D(v) (2 T IR N) denotes Shiiman's function for the polygon ? and D denotes Dirichlet's Integral. We derive an explicit expression for r h , where h () := inf v2X h () D(v) with suitable nite element spaces X h (). F...
متن کاملDigital cohomology groups of certain minimal surfaces
In this study, we compute simplicial cohomology groups with different coefficients of a connected sum of certain minimal simple surfaces by using the universal coefficient theorem for cohomology groups. The method used in this paper is a different way to compute digital cohomology groups of minimal simple surfaces. We also prove some theorems related to degree properties of a map on digital sph...
متن کاملCerebral Artery Segmentation with Level Set Methods
In this paper we present the application of two level set methods (active contour without edges and fast marching) to the problem of segmenting arteries from medical images. The two methods fit in the same Hamilton-Jacobi type equation but their underlying mechanisms are quite different. The first method finds the objects of interest using an energy minimization equation without the information...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interfaces and Free Boundaries
سال: 2005
ISSN: 1463-9963
DOI: 10.4171/ifb/119